منابع مشابه
High Multiplicity Scheduling Problems
These four years proved to be a very interesting and enjoyable period of my life. I was introduced to the international research community and visited many scientific events in different parts of the world. First of all, I want to heartily thank my supervisors, Antoon Kolen, Yves Crama, and Joris van de Klundert, for haven given me the opportunity to join the scientific world and academic commu...
متن کاملHigh-multiplicity cyclic job shop scheduling
We consider the High-Multiplicity Cyclic Job Shop Scheduling Problem, in which we are given a set of identical jobs and must find a schedule that repeats itself with some cycle time τ . In each cycle, operations are processed just as in the previous cycle, but on jobs indexed one greater in the ordering of jobs. There are two objectives of interest: the cycle time τ and the flow time F from the...
متن کاملA Note on Scheduling Identical Coupled Tasks in Constant Time
The coupled tasks problem consists in scheduling n jobs on a single machine. Each job i is made of two operations with processing times ai and bi and a fixed required delay Li between them. Operations cannot overlap in time but operations of different jobs can be interleaved. The objective is to minimize the makespan of the schedule. In this note we show that the problem with identical jobs (∀i...
متن کاملScheduling High-Level Tasks among Cooperative Agents
Scheduling tasks among cooperative agents requires tradeoffs between various factors including task priorities and context-dependent execution times. We have specifically been investigating the space of functions for evaluating alternative distributed task schedules for multi-operator applications. In this paper, we describe some candidate functions and converge on intuitively appealing functio...
متن کاملExtended matching problem for a coupled-tasks scheduling problem
This paper introduces a scheduling problem with coupledtasks in presence of a compatibility graph on a single processor. We investigate a specific configuration, in which the coupled-tasks possess an idle time equal to 2. The complexity of these problems will be studied according to the presence or absence of triangles in the compatibility graph. As an extended matching, we propose a polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computing and Decision Sciences
سال: 2020
ISSN: 2300-3405
DOI: 10.2478/fcds-2020-0004